Filling Curves Constructed in Cellular Automata with Aperiodic Tiling
نویسنده
چکیده
In many constructions on cellular automata, information is transmitted with signals propagating through a defined background. In this paper, we investigate the possibility of using aperiodic tiling inside zones delimited by signals. More precisely, we study curves delineated by CA-constructible functions and prove that most of them can be filled with the NW-deterministic tile set defined by Kari [1]. The achieved results also hint a new possible way to study deterministic tile sets.
منابع مشابه
Investigations of Game of Life Cellular Automata Rules on Penrose Tilings: Lifetime, Ash, and Oscillator Statistics
Abstract. Conway’s Game of Life (GoL) rules can be applied to Cellular Automata (CAs) running on aperiodic grids, namely Penrose tilings. Here we investigate the result of running such CAs from random initial conditions. We describe our experimental setup, and demonstrate that the GoL on the Penrose kite and dart tiling has significantly different statistical behaviour from that on the Penrose ...
متن کاملInvestigations of Game of Life cellular automata rules on Penrose Tilings: lifetime and ash statistics
Conway’s Game of Life rules can be applied to Cellular Automata (CAs) running on aperiodic grids, namely Penrose tilings. Here we investigate the result of running such CAs from random initial conditions. This requires development of a Penrose tiling algorithm suitable for CA experiments, in particular, a tiling that can be lazily expanded as CA activity reaches an edge. We describe such an alg...
متن کاملGliders in Cellular Automata on Penrose Tilings
In this paper, we present the first glider capable of navigating an aperiodic tiling. It inhabits a four-state outer-totalistic cellular automaton, and operates on generic tilings of quadrilaterals. We investigate its behaviour on both the P2 (kite and dart) and P3 (rhombus) Penrose tilings, and characterise the different types of path it can follow. Further, we note that the path followed by t...
متن کاملA Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semitotalistic CA capable of simulating any boolean circuit and any Turing machine on this aperiodic tiling.
متن کاملFixed-point tile sets and their applicationsI
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017